Solutions of a system of forced burgers equation in terms of generalized laguerre polynomials

In this article, we obtain explicit solutions of a linear PDE subject to a class of radial square integrable functions with a monotonically increasing weight function |x|ⁿ⁻¹eβ|x|²/2,${\left|x\right|}^{n-1}{e}^{\beta {\left|x\right|}^2}/2,$, β≥0, x ∈?n$\beta \ge 0,\hspace{0.17em}x\hspace{0.17em}\in {?}^n$. This linear PDE is obtained from a system of forced Burgers equation via the Cole-Hopf transformation. For any spatial dimension n > 1, the solution is expressed in terms of a family of weighted generalized Laguerre polynomials. We also discuss the large time behaviour of the solution of the system of forced Burgers equation.     

Quasi-likelihood analysis for nonsynchronously observed diffusion processes

We consider nonsynchronous sampling of parameterized stochastic regression models, which contain stochastic differential equations. Constructing a quasi-likelihood function, we prove that the quasi-maximum likelihood estimator and the Bayes type estimator are consistent and asymptotically mixed normal when the sampling frequency of the nonsynchronous data becomes large.     

On the complexity of project scheduling to minimize exposed time

We consider project scheduling where the project manager’s objective is to minimize the time from when an adversary discovers the project until the completion of the project. We analyze the complexity of the problem identifying both polynomially solvable and NP-hard versions of the problem. The complexity of the problem is seen to be dependent on the nature of renewable resource constraints, precedence constraints, and the ability to crash activities in the project.     

Polynomial cases of the economic lot sizing problem with cost discounts

In this paper we study the economic lot sizing problem with cost discounts. In the economic lot sizing problem a facility faces known demands over a discrete finite horizon. At each period, the ordering cost function and the holding cost function are given and they can be different from period to period. There are no constraints on the quantity ordered in each period and backlogging is not allowed. The objective is to decide when and how much to order so as to minimize the total ordering and holding costs over the finite horizon without any shortages. We study two different cost discount functions. The modified all-unit discount cost function alternates increasing and flat sections, starting with a flat section that indicates a minimum charge for small quantities. While in general the economic lot sizing problem with modified all-unit discount cost function is known to be NP-hard, we assume that the cost functions do not vary from period to period and identify a polynomial case. Then we study the incremental discount cost function which is an increasing piecewise linear function with no flat sections. The efficiency of the solution algorithms follows from properties of the optimal solution. We computationally test the polynomial algorithms against the use of CPLEX.     

Persistent centers of complex systems

On the basis of some works on persistent centers and weakly persistent centers, in this paper we discuss a generalized version of persistent center and weakly persistent center for complex planar differential systems, in which conjugacy of variables may not be required. We give some complex systems which have a persistent center or weakly persistent center at the origin. Then, we find all conditions of persistent center for cubic systems and all conditions of weakly persistent center for complex cubic Lotka–Volterra system. Relations between complex systems and real ones are given concerning persistent centers and weakly persistent centers.     

Orthogonal polynomials for exponential weights on

Let I=[0,d), where d is finite or infinite. Let , where and Q is continuous and increasing on I, with limit ∞ at d. We study the orthonormal polynomials associated with the weight , obtaining bounds on the orthonormal polynomials, zeros, and Christoffel functions. In addition, we obtain restricted range inequalities.     

极小化完工时间和的有界批调度问题

考虑m台并行批加工同型机上n个带有释放时间的工件的调度问题,目标是极小化完工时间和.给出了一个多项时间近似方案.     

Ternary analogues of Lie and Malcev algebras

We consider two analogues of associativity for ternary algebras: total and partial associativity. Using the corresponding ternary associators, we define ternary analogues of alternative and assosymmetric algebras. On any ternary algebra the alternating sum [a, b, c] = abc − acb − bac + bca + cab − cba (the ternary analogue of the Lie bracket) defines a structure of an anticommutative ternary algebra. We determine the polynomial identities of degree ?7 satisfied by this operation in totally and partially associative, alternative, and assosymmetric ternary algebras. These identities define varieties of ternary algebras which can be regarded as ternary analogues of Lie and Malcev algebras. Our methods involve computational linear algebra based on the representation theory of the symmetric group.     

On polynomial digraphs

Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).     

Optimal broadcast domination in polynomial time

Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination powers. Broadcast domination assigns an integer power f(v)?0 to each vertex v of a given graph, such that every vertex of the graph is within distance f(v) from some vertex v having f(v)?1. The optimal broadcast domination problem seeks to minimize the sum of the powers assigned to the vertices of the graph. Since the presentation of this problem its computational complexity has been open, and the general belief has been that it might be NP-hard. In this paper, we show that optimal broadcast domination is actually in P, and we give a polynomial time algorithm for solving the problem on arbitrary graphs, using a non-standard approach.